Secure data transmission using quantum communication

ABSTRACT

Methods and systems for transmitting data are described. A random data stream is generated. A data stream is generated comprising the random data stream and indicators as to which data of the random data stream is valid data to be communicated to a recipient. The random data stream and/or the data stream may be communicated using quantum entanglement.

BACKGROUND

Classical encryption generally involves scrambling clear text or othernon-encrypted information according to a data scrambling algorithm inwhich the data scrambling algorithm's output data is modified orcontrolled by an encryption key. The encrypted output data is thenstored in a physical storage medium such as a hard drive or otherencrypted media, or transmitted to a receiver over a transmission mediaas a scrambled version of the clear text. The encryption algorithm maybe as simple as an “exclusive or” function of the clear text and theencryption key, or a complex function such as Advanced EncryptionStandard (AES) or Rivest Shamir Adleman (RSA) as is well known in theart. Decryption generally involves descrambling the encrypted data fromthe physical storage medium such as a hard drive or from the receivedtransmission media into the original information by using a decryptionalgorithm which is controlled or modified by a decryption key. Thedecryption algorithm may be as simple as an “exclusive or” function ofthe encrypted data and the encryption key or a complex function such asAES or RSA. The encryption and decryption keys may be the same, e.g.,symmetric keys, or different, e.g., asymmetric keys such aspublic-private pair keys. Generally these encryption and decryption keysare difficult to crack, so they are used over and over again. However,if these keys are hacked, cracked, or otherwise become known, then allsubsequent (and even prior recorded encrypted messages) may become knownor knowable.

SUMMARY

Illustrative examples of the present disclosure include, withoutlimitation, a method for transmitting data. The method may comprisegenerating first data comprising a random data stream, and transmittingsecond data comprising indicators as to which data of the random datastream is valid data to be communicated.

In another aspect, an apparatus for transmitting data is provided. Thesystem may comprise a random number generator configured to generate arandom data stream. The system may also comprise a transmitterconfigured to transmit data comprising indicators as to which data ofthe random data stream is valid data.

In another aspect, a method for receiving data is provided. The systemmay comprise receiving first data comprising a random data stream. Themethod may also comprise receiving second data comprising indicators asto which data of the random data stream is valid data to be received.The method may also comprise using the first and second data to generatethe valid data.

In another aspect, a system for transmitting data is provided. Thesystem may comprise a random number generator and a first transmitterconfigured to transmit first data comprising a random data streamgenerated by the random number generator. The system may also comprise asecond transmitter configured to transmit second data comprisingindicators as to which data of the random data stream is valid data. Thesecond transmitter may use quantum teleportation to transmit the seconddata.

The features, functions, and advantages that have been discussed can beachieved independently in various embodiments or may be combined in yetother embodiments, further details of which can be seen with referenceto the following description and drawings.

BRIEF DESCRIPTION OF DRAWINGS

Throughout the drawings, reference numbers may be re-used to indicatecorrespondence between referenced elements. The drawings are provided toillustrate examples described herein and are not intended to limit thescope of the disclosure.

FIG. 1 depicts an example system which may be used in conjunction withthe present disclosure;

FIG. 2 depicts an example system which may be used in conjunction withthe present disclosure;

FIG. 3 depicts an example system which may be used in conjunction withthe present disclosure;

FIG. 4 depicts an example encryption/decryption method;

FIG. 5 depicts an example procedure for transmitting data in accordancewith this disclosure;

FIG. 6 depicts an example procedure for transmitting data in accordancewith this disclosure;

FIG. 7 depicts an example procedure for transmitting data in accordancewith this disclosure; and

FIG. 8 depicts an example procedure for transmitting data in accordancewith this disclosure.

DETAILED DESCRIPTION

To counter the potential compromising of encryption keys, completelyrandom non-repetitive “one-time pads” (OTP) may be used. The concept ofthe one-time pads says that the encryption bits must be truly random(i.e., not algorithmically based) and can only be used once (i.e., noreuse of the encryption bits.) As long as these completely randomone-time pad keys are not revealed, they have been mathematically provento have “perfect secrecy” and are unable to be decrypted even if theclear text is known. Today, these completely random keys or OTPs must beshared over a completely secure channel, while the encrypted messagesderived from them may be distributed over a non-secure or publiccommunication medium or network, or stored in a physical medium such asa hard drive.

Quantum communication involves encoding information as quantum bits. Asused herein, a “quantum bit,” which may be also referred to a qubit orqbit, is a two-state quantum mechanical system. The quantum mechanicalsystem may be realized using, for example, the polarization of a singlephoton. The qubit may have two polarization states—vertical polarizationand horizontal polarization. Quantum mechanics allows a qubit to be inone state, the other state, or a superposition of both states at anygiven point in time. This physics process is known as quantum mechanicalentanglement or quantum entanglement.

Quantum cryptography is the use of quantum mechanical effects to performcryptographic tasks, such as, for example, encrypting and decryptingdata. Quantum key distribution (QKD) is a quantum cryptographictechnique that allows secure sharing of a quantum key to two endpointsin a point-to-point communication between a sender and a receiver. Thisquantum key is generated as a completely random stream of entangled qbitpairs with one stream of the entangled pairs sent to the sender and theother stream of “mate” entangled pairs sent to the receiver.

The sender encrypts the data using the random quantum key and sends thisquantum encrypted data to the receiver. The receiver decrypts thequantum encrypted data using the random quantum key. This type ofquantum encryption may ensure secure communications over standardnon-secure (public) communications channels, such as, for example,unsecure public communications channels such as the Internet. Animportant and unique property of QKD is the ability of the twocommunicating users to detect the presence of any third party trying toeavesdrop and gain knowledge of the key, since the process of measuringa quantum system in general disturbs the system and is thus detectable.A third party trying to eavesdrop on the key must in some way measureit, thus introducing detectable anomalies. A physics property known asthe no-cloning theorem says that it is not possible to reconstruct aquantum mechanical entanglement once it has been disturbed.

By using quantum superpositions or quantum entanglement and transmittinginformation in quantum states, a communication system can be implementedwhich detects eavesdropping. If the level of eavesdropping is below acertain threshold, a key can be produced that is guaranteed to be secure(i.e., the eavesdropper has no information about it), otherwise nosecure key is possible and communication is aborted. Quantum keys can beused to generate classical keys which can be repeatedly used inclassical symmetric or asymmetric encryption schemes, or quantum keyscan be implemented as a continuous random stream used as a completelyrandom non-repetitive quantum “one time pad” (OTP). However, in manyapplications, there are problems, difficulties, and complexities inimplementing communications with present encryption methods, completelyrandom keys such as OTPs, or even non-completely-random keys such aspseudo-random codes and/or keys. Such problems include processingoverhead, non-detectable tampering including for example, eavesdroppersand man-in-the-middle attacks. Further, there are difficulties inimplementing quantum systems and QKD systems where the random quantumbit stream is the actual encryption key. Therefore, there exists a needfor improved methods, apparatus, and systems for implementingcommunications using randomness, and for secure data transmissions usingquantum communications.

Classical methods of storing and/or transmitting clear text or othernon-encrypted information in a secure manner comprise many differenttypes of encryption techniques. Improvements disclosed herein maycomprise storage or transmission of completely random or pseudo-randomdata streams with the clear text or other non-encrypted informationhidden within the completely random or pseudo-random data streams.Instead of encrypting or scrambling the clear text into encrypted datausing cryptographic keys, clear text may be “hidden in plain sight” inrandom, pseudo-random, or other data streams with an encoding scheme orother indicators which enable the receiver to identify which bits,bytes, or other information is valid data. This approach to encodinginformation “in plain sight” within random or pseudo-random streams canbe particularly useful, especially for quantum communications.

Quantum cryptographic techniques may require a direct connection betweenthe sender and the receiver for the generation and sharing of the randomencryption key. Consequently, using quantum key distribution to sendencrypted data over a large communications network comprised of multiplenodes may be more difficult than desired and, in some cases, may not befeasible.

Some methods for transporting an encryption key from a sender to areceiver across multiple nodes within a communications network mayrequire that each of the nodes have quantum key distributioncapabilities. In some cases, routing algorithms, graph theoryalgorithms, and metrics that have been disseminated to all nodes withinthe communications network may be used to transport encryption keysacross these nodes.

These types of methods may be more time-consuming than desired and/ormay require more processing power, hardware resources, and/or softwareresources than desired. Further, ensuring that every node within acommunications network has quantum key distribution capabilities may bemore expensive than desired.

Some cryptographic methods may use pseudorandom numbers, which is asequence of numbers that approximates the properties of random numbers.However, a pseudorandom sequence is not truly random in that it iscompletely determined by a finite set of initial values and arereproducible. Generally, random sequences may be used for encryptionkeys but not for actual communications of the data.

In various implementations described in this disclosure, methods andsystems for transmitting data using a random sequence is described,where the random stream is actually carrying the information and notacting as the encryption key. In some implementations, a random bitsequence is generated and transmitted to the recipient. A valid datasequence to be transmitted to the recipient may be indicated by sendinga second sequence to the recipient that indicates which of the bits inthe random bit sequence represent the valid data sequence.

Some example implementations described in this disclosure includesending the random sequence as well as the second sequence as quantumdata across one or more nodes in a communications network. In oneexample implementation, a node receives an input signal comprised ofincoming photons carrying data. Quantum states of the incoming photonsare transferred to outgoing photons using quantum teleportation suchthat the data is transferred, or copied, to the outgoing photons. Anoutput signal comprised of the outgoing photons carrying the data maythen be sent out from the node to a next node.

Referring now to the figures and, in particular, with reference to FIG.1, an illustration of a communications environment is depicted in theform of a block diagram in accordance with an illustrative example.Further details may also be found in U.S. application Ser. No.13/848,872, filed Mar. 22, 2013, and U.S. application Ser. No.13/778,944, filed Feb. 27, 2013, both of which are incorporated byreference. Communications environment 100 includes communicationsnetwork 102. Communications network 102 may be comprised of plurality ofnodes 104.

As used herein, a “node” in plurality of nodes 104 may be implemented ina number of different ways. For example, without limitation, a node maycomprise at least one of a communications device, a switching device, anetwork switch, a router, a processor unit, a computer, an integratedcircuit, a modem, a hub, a server, a workstation, a digital handset, orsome other type of communications device.

As used herein, the phrase “at least one of,” when used with a list ofitems, means different combinations of one or more of the listed itemsmay be used and only one of the items in the list may be needed. Forexample, “at least one of item A, item B, and item C” may include,without limitation, item A; both item A and item B; item A, item B, anditem C; or item B and item C. In other examples, “at least one of” maybe, for example, without limitation, two of item A, one of item B, andten of item C; four of item B and seven of item C; or some other type ofcombination. The item may be a particular object, thing, or a category.In other words, “at least one of” means any number of and anycombination of items may be used from the list, but not all of the itemsin the list may be required.

First communicator 106 and second communicator 108 may be examples ofnodes in plurality of nodes 104. First communicator 106 is configured tosend secure data to second communicator 108. For example, firstcommunicator 106 may encrypt unencrypted data 110 using first quantumkey distributor 112 to form encrypted data 114. Second communicator 108may receive encrypted data 114 and then decrypt encrypted data 114 usingsecond quantum key distributor 116 to form decrypted data 118. Decrypteddata 118 may contain unencrypted data 110. In this manner, secondquantum key distributor 116 may decrypt encrypted data 114 to retrieveunencrypted data 110.

In this illustrative example, first quantum key distributor 112 andsecond quantum key distributor 116 may be implemented using standardquantum key distribution protocols. First quantum key distributor 112and second quantum key distributor 116 may communicate over a quantumchannel (not shown in this view) to share a quantum encryption key thatmay be used to encrypt and decrypt data. In this manner, encrypted data114 may be quantum encrypted data.

The quantum encryption key may be comprised of one or more qubits. Insome cases, the quantum encryption key may be a continuous stream ofqubits. Further, depending on the implementation, the quantum encryptionkey may or may not be random.

In one illustrative example, first quantum key distributor 112 mayinclude an encryptor configured to receive a random number from a datagenerator, which in some embodiments may be a random number generator.The random number generator may be implemented within or outside offirst quantum key distributor 112. The encryptor may use the randomnumber to encrypt unencrypted data 110 and form encrypted data 114.

As depicted, encrypted data 114 may be sent from first communicator 106to second communicator 108 across number of nodes 120 along path 122. Asused herein, a “number of,” when used in reference to items, may meanone or more items. In this manner, number of nodes 120 may be one ormore nodes.

In this illustrative example, path 122 may comprise the sequence ofnodes in communications network 102 through which encrypted data 114 istransmitted. Path 122 may include first communicator 106, secondcommunicator 108, and number of nodes 120. Number of nodes 120 may usequantum teleportation to send encrypted data 114 received at number ofnodes 120 from first communicator 106 to second communicator 108. Byusing quantum teleportation, encrypted data 114 may remain encrypted asencrypted data 114 passes through number of nodes 120.

Node 124 is an example of one of number of nodes 120. Node 124 may beconfigured to receive encrypted data 114 over first communicationschannel 126 and send out encrypted data 114 over second communicationschannel 128. As used herein, a “communications channel,” such as firstcommunications channel 126 and second communications channel 128, may beselected from a group that includes a wired communications channel, awireless communications channel, an optical communications channel, afiberoptic channel, a waveguide, or some other type of communicationschannel or link.

Node 124 uses quantum teleporter 130 to receive and send out encrypteddata 114. In particular, quantum teleporter 130 may receive input signal132 over first communications channel 126 from a previous node withrespect to path 122. This previous node may be first communicator 106 orone of number of nodes 120. Input signal 132 may be comprised ofplurality of incoming photons 134 arriving at quantum teleporter 130over time.

Quantum teleporter 130 uses plurality of incoming photons 134 to formplurality of outgoing photons 136. Quantum teleporter 130 sends outplurality of outgoing photons 136 in the form of output signal 138 oversecond communications channel 128 to a next node with respect to path122.

As depicted, quantum teleporter 130 includes entanglement creator 140and entanglement remover 142. Entanglement creator 140 is configured tocreate pair of entangled photons 144 for each one of plurality ofincoming photons 134 received. Pair of entangled photons 144 includesfirst entangled photon 146 and second entangled photon 148. Firstentangled photon 146 and second entangled photon 148 may be consideredentangled when the quantum state of each of these photons may need to bedescribed with reference to the other photon, even though the twophotons may be physically separated.

First entangled photon 146 is sent to meet with one of plurality ofincoming photons 134. For example, first entangled photon 146 may besent to meet with incoming photon 150 in entanglement remover 142.Second entangled photon 148 may be sent in a different direction asoutgoing photon 152. Incoming photon 150 may carry encryptedinformation.

Entanglement remover 142 receives both incoming photon 150 and firstentangled photon 146. In response to receiving both incoming photon 150and first entangled photon 146, entanglement remover 142 removes, ordestroys, the entanglement between first entangled photon 146 and secondentangled photon 148.

When the entanglement between first entangled photon 146 and secondentangled photon 148 is removed, outgoing photon 152 is formed.Simultaneously, quantum state 154 of incoming photon 150 is transferredto, or copied to, outgoing photon 152. The transferring of quantum state154 of incoming photon 150 to outgoing photon 152 results in theencrypted information that is carried by incoming photon 150 beingteleported to outgoing photon 152. Outgoing photon 152 carrying theencrypted information may then be sent out, or output, from quantumteleporter 130.

As a result of this quantum teleportation, outgoing photon 152 outputfrom quantum teleporter 130 may be relatively indistinguishable fromincoming photon 150 received at quantum teleporter 130. In this manner,encrypted data 114 carried by plurality of incoming photons 134 may beteleported to plurality of outgoing photons 136 without ever beingdecrypted, modified, or processed in some other manner.

Each node in plurality of nodes 104 may have a quantum teleportersimilar to quantum teleporter 130. In this manner, quantum teleportationmay be used to send quantum encrypted data across one or more ofplurality of nodes 104 in communications network 102.

The illustration of communications network 102 within communicationsenvironment 100 in FIG. 1 is not meant to imply physical orarchitectural limitations to the manner in which an illustrativeembodiment may be implemented. Other components in addition to or inplace of the ones illustrated may be used. Some components may beoptional. Additionally, the blocks are presented to illustrate somefunctional components. One or more of these blocks may be combined,divided, or combined and divided into different blocks when implementedin other illustrative embodiments.

For example, although first quantum key distributor 112 is depicted asbeing part of first communicator 106, first quantum key distributor 112may be considered separate from first communicator 106, but incommunication with first communicator 106 in other examples. Similarly,although second quantum key distributor 116 is depicted as being part ofsecond communicator 108, second quantum key distributor 116 may beconsidered separate from second communicator 108, but in communicationwith second communicator 108 in other examples.

Further, although the illustrative examples have been described usingphotons, some other type of quantum mechanical system may be used. Forexample, without limitation, input signal 132 may be comprised of aplurality of incoming electrons and output signal 138 may be comprisedof a plurality of outgoing electrons. In other words, quantumcommunications and quantum cryptography between plurality of nodes 104may be implemented using electrons instead of photons, or some othertype of quantum mechanical system that may be used to form qubits.

With reference now to FIG. 2, an illustration of a path within acommunications network is depicted in accordance with an illustrativeexample. Communications network 200 is an example of one implementationfor communications network 102 in FIG. 1. Path 201 throughcommunications network 200 includes first communicator 202, node 204,and second communicator 206. First communicator 202, node 204, andsecond communicator 206 are examples of implementations for firstcommunicator 106, node 124, and second communicator 108, respectively,in FIG. 1.

As depicted, first communicator 202 is configured to encrypt unencrypteddata 212 using first quantum key distributor 208 to form encrypted data214. First communicator 202 sends encrypted data 214 to node 204. Node204 uses quantum teleporter 216 to teleport the encrypted data andoutput teleported encrypted data 218. Second communicator 206 usessecond quantum key distributor 210 to decrypt teleported encrypted data218 and form decrypted data 220.

With reference now to FIG. 3, an illustration of quantum teleporter 216from FIG. 2 is depicted in accordance with an illustrative example. Inthis illustrative example, quantum teleporter 216 includes entanglementremover 300 and entanglement creator 302. Entanglement remover 300includes beam splitter 304, detector 306, and detector 308. Entanglementcreator 302 includes coupled photon creator 310, beam splitter 312, waveplate 313, mirror 314, and mirror 316.

As depicted, coupled photon creator 310 is configured to create pair ofcoupled photons 318. Pair of coupled photons 318 includes first photon320 and second photon 322. In one illustrative example, coupled photoncreator 310 may include a laser, an intensity control device, apolarization control device, a frequency control device, and a nonlinearoptical element. The nonlinear optical element may be used to convert asingle laser photon emitted from the laser into pair of coupled photons318.

Beam splitter 312 in entanglement creator 302 may be used to entanglefirst photon 320 and second photon 322. Prior to becoming entangled withsecond photon 322, first photon 320 may be sent through wave plate 313.Wave plate 313 is used to change the polarization of first photon 320.In one illustrative example, wave plate 313 takes the form of ahalf-wave plate that is configured to rotate the polarization directionof first photon 320.

First photon 320 may be sent through wave plate 313 towards mirror 314.Mirror 314 directs first photon 320 towards beam splitter 312.Similarly, second photon 322 is sent towards mirror 316. Mirror 316directs second photon 322 towards beam splitter 312. In other words,mirror 314 and mirror 316 are used to steer first photon 320 and secondphoton 322, respectively, towards beam splitter 312. Of course, in otherillustrative examples, a plurality of optical elements may be used tosteer first photon 320 and second photon 322 towards beam splitter 312.

Beam splitter 312 causes entanglement between first photon 320 andsecond photon 322 such that pair of entangled photons 324 is formed.Pair of entangled photons 324 includes first entangled photon 326 andsecond entangled photon 328. In some illustrative examples, firstentangled photon 326 may be referred to as a transporter photon.

First entangled photon 326 is sent to meet with incoming photon 330 atentanglement remover 300. Both incoming photon 330 and first entangledphoton 326 are received at beam splitter 304 within entanglement remover300. Incoming photon 330 and first entangled photon 326 are interferedat beam splitter 304. Beam splitter 304 may be implemented using, forexample, a 50/50 beam splitter.

Detector 306 and detector 308 may be used to measure first output 332and second output 334, respectively, of beam splitter 304. Detector 306and detector 308 may each be implemented using, for example, withoutlimitation, control optics, a polarization measurement device, and alight-to-electronic signal converter. The light-to-electronic signalconverter may take the form of, for example, without limitation, aphotodiode, an avalanche photodiode, a photomultiplier, or some othertype of element.

In response to incoming photon 330 and first entangled photon 326meeting at beam splitter 304 and the measurement of at least one offirst output 332 and second output 334 by detector 306 and detector 308,respectively, the entanglement between first entangled photon 326 andsecond entangled photon 328 is removed to form outgoing photon 336.Simultaneously, the quantum state of incoming photon 330 is transferredto outgoing photon 336.

In this manner, outgoing photon 336 may have the same quantum state asincoming photon 330 such that outgoing photon 336 is relativelyindistinguishable from incoming photon 330. The transferring of thequantum state of incoming photon 330 to outgoing photon 336 results inthe teleportation of the encrypted information carried by incomingphoton 330 to outgoing photon 336. Quantum teleporter 216 outputsoutgoing photon 336.

The illustrations of communications network 200 in FIG. 2 and quantumteleporter 216 in FIG. 3 are not meant to imply physical orarchitectural limitations to the manner in which an illustrativeembodiment may be implemented. Other components in addition to or inplace of the ones illustrated may be used. Some components may beoptional.

The different components shown in FIG. 3 may be illustrative examples ofhow components shown in block form in FIG. 1 can be implemented asphysical structures. Additionally, some of the components in FIG. 3 maybe combined with components in FIG. 1, used with components in FIG. 1,or a combination of the two. Some or all of FIGS. 1, 2 and/or 3, inparticular the quantum entanglement creator, may be included in what maybe referred to as a quantum entanglement system.

The flowcharts and block diagrams in the different depicted examplesillustrate the architecture, functionality, and operation of somepossible implementations of apparatuses and methods in an illustrativeexample. In this regard, each block in the flowcharts or block diagramsmay represent a module, a segment, a function, and/or a portion of anoperation or step.

In some alternative examples, the function or functions noted in theblocks may occur out of the order noted in the figures. For example, insome cases, two blocks shown in succession may be executed substantiallyconcurrently, or the blocks may sometimes be performed in the reverseorder, depending upon the functionality involved. Also, other blocks maybe added in addition to the illustrated blocks in a flowchart or blockdiagram.

Many encryption methodologies typically use random data streams forencryption keys, but not for the actual communications. Illustratedfurther in this disclosure are methods and systems for producing arandom data stream using a quantum stream, thus providing a way tocommunicate information using, for example, a random bit stream whichmay be usable for quantum communication.

Referring to FIG. 4, illustrated is a typical or classical encryptionmethod. Desired valid bits that are to be transmitted are illustrated bythe desired valid bits 400 which in this example read from right to leftfrom t₀ is 010101. An encryption key 410 may be used to transform thedesired valid bits 400 to encrypted coded bits 420, which in thisexample read from right to left is 011110. The recipient of theencrypted coded bits 420 may use decryption key 430 to transform theencrypted coded bits 420 to desired valid bits 400, which in thisexample read from right to left is 010101.

FIG. 5 illustrates an example implementation of a method of transmittingdata using a random sequence, where the random stream is actuallycarrying the information and not acting as the encryption key. Referringto FIG. 5, and reading from right to left from t₀, a bit stream 500 isshown that may represent a true random bit stream or may alternativelyin some cases represent a pseudorandom sequence. Alternatively, bitstream 500 may also be a non-random stream of bits from a new orexisting data source. The bit stream 500 can be, for example, a mediafile such as the Encyclopedia Brittanica, or any other book, song, videoor other data stream. The process would work the same, with the secondstream indicating where in the stream to look for the information thatis “hiding in plain sight.” Also illustrated is the desired validnon-random bits 510 that are to be transmitted.

In one implementation, pauses may be used when transmitting theinformation to indicate how the random bit stream is to be interpretedso as to arrive at the desired valid bits. In this implementation, if abit in the bit stream 500 is the same or a correct match with the nextvalid bit, then the bit is transmitted followed by a pause. In oneimplementation, the pause may be a delay in transmission thatcorresponds to the period of transmission for one bit. If the bit in thebit stream 500 is incorrect and does not match the next valid bit, thenthe bit is transmitted without a pause. Incorrect bits are transmitteduntil another match occurs, upon which the bit is transmitted followedby a pause.

Referring again to FIG. 5, and reading from right to left, in the validdata stream 510, the first bit to be transmitted is a 0. Since the firstbit of the bit stream 500 is a 0 and thus matches, the 0 is transmittedand a pause is included in the transmitted bits 520. Because of theinserted pause, the 0 which follows in the bit stream 500 is ignored ordropped, and the next bit in the bit stream 500 is a 1, which matchesthe next bit in the valid data stream 510, and thus another pause isinserted, indicating that the bit prior to the pause is valid.

Due to the pause, the next bit 0 in the bit stream 500 is skipped ordropped, and the next bit in the bit stream 500 is a 1. Since this bitdoes not match the next valid bit in the valid bit stream 510 which is a0, the 1 in the random bit stream 500 is transmitted without a pause.The same occurs for the next two bits in the random bit stream 500 whichare also a 1. The next bit in the bit stream 500 is a 0, which matchesthe next bit in the valid bit stream 510. The 0 is transmitted, and thena pause is inserted, indicating that the bit prior to the pause isvalid.

The next bit in the bit stream 500 is 0 which is passed over because ofthe pause, and the following bit in the bit stream 500 is a 1. Sincethis matches the next bit in the valid bit stream 510, the bit istransmitted followed by a pause. This pattern of transmitting pausesafter a valid bit continues until the valid bit stream is completed. Inone example, the paused random bits may be dropped and not transmitted.Furthermore, two consecutive pauses can be transmitted to indicate anend of character, three consecutive pauses can be transmitted toindicate an end of word, four consecutive pauses can be transmitted toindicate end of message, and so on. Other combinations of pauses may beused to indicate the status of the message.

The resulting transmitted bit stream 520 may be transmitted to therecipient and received as bit stream 530. The recipient may interpretthe received bit stream 530 and use the pauses to identify which bits ofthe bit stream 530 represent valid bits. In this implementation, thebits immediately preceding a pause are valid bits, and the recipient maydetermine the extracted bits 540 that match the original desired validbits 510. In one implementation, when a random stream is desired to betransmitted and security is not an issue, the random bit stream 520 withpauses may be transmitted over an unsecure network or stored on anunsecured hard drive. In one implementation, the bit stream 500 may betransmitted to the intended recipient over a first communicationchannel, and may be transmitted using secure or non-secure means. Aneavesdropper that intercepts the bit stream 500 would only see a randomstream of bits and pauses. However, the recipient may use the pauses todetermine which of the bits in the bit stream 500 represent valid bits.

FIG. 6 illustrates an example implementation of the described datatransmission using quantum distribution. A quantumtransmitter/communicator 600 is shown that may be implemented using oneor more devices. As used herein, the quantum transmitter/communicator600 may also be referred to as a quantum distributor. Also illustratedis a stream of entangled random qbits 610 without pauses. The quantumtransmitter/communicator 600 transmits the entangled mate qbits 620which is received by a quantum receiver 630.

FIG. 6 illustrates a set of valid bits 640 to be communicated to thequantum receiver 630. The quantum transmitter/communicator 600determines valid bits 640 to be transmitted and measures or disentanglescorresponding random qbits 610 and compares the qbits 610 and valid bits640. If a qbit and a corresponding valid bit is the same, then a pauseis included in communications stream 650 which may be transmitted overcommunications link 660. If a qbit 610 and a corresponding valid bit 640are different, then there is no pause. This process continues until thevalid bits 640 to be transmitted have been accounted for in thecommunications stream 650. The comparison of qbits 610 and valid bits640 may be performed by a comparator function or comparator system.

The quantum receiver 630 receives the communications stream 650 via thecommunications link 660 including pauses. The quantum receiver 630 alsoreceives entangled mate qbits 620. The entangled mate qbits 620 may bereceived over a communications channel capable of sending data usingquantum teleportation. The quantum receiver 630 inverts the entangledmate qbits since the quantum entanglement process causes the entangled“mate” qbits 620 to be the inverse of entangled transmitter qbits 610.When a pause is detected, then the quantum receiver 630 registers theprevious bit as a valid bit. The quantum receiver 630 continues thisprocess until the valid bit stream 640 has been determined.

By using a quantum delivery means, the quantum states of the informationcannot be copied, thereby allowing for eavesdropping to be detected andproviding an inherently secure communications means.

It should be noted that the system illustrated in FIG. 6 is an exampleimplementation, and the described functionality can be implemented usingdistributed components or as an integrated system. For example, theentangling system, random number generator, and quantum transmitter canbe implemented as separate components.

It should be noted that the previous implementation using pauses is asimple illustrative example that may be understood by an eavesdropper oncommunications link 650. However, the use of a random bit stream tosecurely transmit data by using a corresponding decoding stream may beimplemented using alternative more secure ways to indicate which bits ofthe random bit stream represent the valid bits.

In one alternative example, the communications stream 650 may be used aspointers or indicators of the desired valid bits 640 in the random qbitstream 620 by transmitting all bits in communications stream 650 as 0s,except bits that match the valid bit stream 640 are followed by a 1 (nota pause). Thus when the current bit in the random bit stream matches thecurrent valid bit to be transmitted, then a 0 is transmitted, followedby a 1. If there is no match, then a 0 is transmitted and the nextmeasurement is taken. When the quantum receiver detects a 1, then thisindicates that the previously received bit is a valid bit. Since in thisexample the communications link stream 650 is no longer carrying validbits 640, just a string of 0s, and a 1 as an indicator of a valid bit orprevious valid bit 640 in totally random qbit stream 620, then aneavesdropper of communications link stream 650 obtains no valid bits 640at all. Likewise, an eavesdropper of entangled mate qbits 620 would alsojust see random qbits 620 with no valid bits 640. A successfuleavesdropper must eavesdrop on both streams simultaneously, correlatethe pointers to see the valid bits 640, and would be detected bydisturbing quantum qbit stream 620.

In another alternative example, all of the random bits in the randomqbit stream 610 are transmitted with pauses after the valid bits 640,but the next bit in the random bit stream 610 is held instead of beingdropped during the pause, and that held bit is then transmitted afterthe pause. In this way true randomness is maintained in communicationsstream 650 because no random bits are discarded. Thus in thisimplementation, if the current bit in the random qbit stream 610 doesnot match the next valid bit 640, then the bit is transmitted. If thecurrent bit in the random qbit stream 610 matches the next valid bit640, then a pause is inserted. When the quantum receiver detects apause, then this indicates that the previously received bit is a validbit 640, but random qbits 610 are held during a pause and transmittednext instead of being dropped.

In another alternative example, all of the random bits in thecommunications link stream 650 are transmitted with a 1 when the currentbit in the random qbit stream 620 does not match the current valid bit640, and a 0 indicating that the current bit in the random qbit stream620 matches the current valid bit 640. When the quantum receiver detectsa 0, then this indicates that the current random qbit 620 is a validbit. When the quantum receiver detects a 1, then this indicates that thecurrent random qbit 620 is not valid, so in this case receiver 630inverts that random qbit 620 to yield the correct valid bit 640. In thisexample, communications stream 650 is a stream of valid or invalid “bitpointers” which are used by receiver 630 to yield the exactly correctvalid bits 640. Eavesdroppers listening in on either channel cannotdetect any valid bits 640. Only by eavesdropping on both communicationslink stream 650 and random quantum qbit stream 620 would an eavesdropperbe successful, and then they would be detected for disturbing thequantum qbit stream 620.

FIG. 7 illustrates an example operational procedure 700 for transmittingdata. Referring to FIG. 7, operation 701 illustrates generating a datastream. Operation 701 may be followed by operation 702. Operation 702illustrates transmitting data comprising indicators as to which data ofthe data stream is valid data to be communicated. In one implementation,the indicators may comprise pauses. In some implementations, the datastream may be a random data stream. In one implementation, the datastream may be transmitted, which may or may not be a quantum random datastream.

FIG. 8 illustrates an example operational procedure 800 for transmittingdata. Referring to FIG. 8, operation 801 illustrates generating a bitstream. In some implementations, the bit stream may be a random bitstream. In one implementation, the bit stream may be transmitted to therecipient. Operation 801 may be followed by operation 802. Operation 802illustrates determining if a current bit of the bit stream correspondsto a valid bit to be transmitted. If the current bit corresponds to avalid bit, then operation 802 may be followed by operation 803.Operation 803 illustrates transmitting an indication that thetransmitted bit is a valid bit. If the current bit does not correspondto a valid bit, then operation 802 may be followed by operation 804.Operation 804 illustrates transmitting an indication that thetransmitted bit is not a valid bit. As described above, in variousimplementations a pause, 1, or 0 may be used to indicate a valid bit,and invalid bits may be indicated by the lack of a pause, or by a 1 or 0depending on the implementation. Operations 803 and 804 may be followedby operation 805. Operation 805 illustrates determining if all of thevalid data has been transmitted. If all of the valid data has beentransmitted, then operation 805 may be followed by operation 806. If allof the valid data has been transmitted, then operation 805 may befollowed by operation 802.

Although not required, the methods and systems disclosed herein may bedescribed in the general context of computer-executable instructions,such as program modules, being executed by a computer. Suchcomputer-executable instructions may be stored on any type ofcomputer-readable storage device that is not a transient signal per se.Generally, program modules include routines, programs, objects,components, data structures and the like that perform particular tasksor implement particular abstract data types. Moreover, it should beappreciated that the methods and systems disclosed herein and/orportions thereof may be practiced with other computer systemconfigurations. The methods and systems disclosed herein may also bepracticed in distributed computing environments where tasks areperformed by remote processing devices that are linked through acommunications network. In a distributed computing environment, programmodules may be located in both local and remote memory storage devices.

Additionally, it should be appreciated that the functionality disclosedherein might be implemented in software, hardware or a combination ofsoftware and hardware. Other implementations should be apparent to thoseskilled in the art. In addition, the functionality provided by theillustrated modules may in some embodiments be combined in fewer modulesor distributed in additional modules. Similarly, in some embodiments thefunctionality of some of the illustrated modules may not be providedand/or other additional functionality may be available.

Conditional language used herein, such as, among others, “can,” “could,”“might,” “may,” “e.g.,” and the like, unless specifically statedotherwise, or otherwise understood within the context as used, isgenerally intended to convey that certain examples include, while otherexamples do not include, certain features, elements, and/or steps. Thus,such conditional language is not generally intended to imply thatfeatures, elements and/or steps are in any way required for one or moreexamples or that one or more examples necessarily include logic fordeciding, with or without author input or prompting, whether thesefeatures, elements and/or steps are included or are to be performed inany particular example. The terms “comprising,” “including,” “having,”and the like are synonymous and are used inclusively, in an open-endedfashion, and do not exclude additional elements, features, acts,operations, and so forth. Also, the term “or” is used in its inclusivesense (and not in its exclusive sense) so that when used, for example,to connect a list of elements, the term “or” means one, some, or all ofthe elements in the list.

In general, the various features and processes described above may beused independently of one another, or may be combined in different ways.All possible combinations and subcombinations are intended to fallwithin the scope of this disclosure. In addition, certain method orprocess blocks may be omitted in some implementations. The methods andprocesses described herein are also not limited to any particularsequence, and the blocks or states relating thereto can be performed inother sequences that are appropriate. For example, described blocks orstates may be performed in an order other than that specificallydisclosed, or multiple blocks or states may be combined in a singleblock or state. The example blocks or states may be performed in serial,in parallel, or in some other manner. Blocks or states may be added toor removed from the disclosed examples. The example systems andcomponents described herein may be configured differently thandescribed. For example, elements may be added to, removed from, orrearranged compared to the disclosed examples.

While certain example or illustrative examples have been described,these examples have been presented by way of example only, and are notintended to limit the scope of the inventions disclosed herein. Indeed,the novel methods and systems described herein may be embodied in avariety of other forms. The accompanying claims and their equivalentsare intended to cover such forms or modifications as would fall withinthe scope and spirit of certain of the inventions disclosed herein.

What is claimed:
 1. A method for transmitting data comprising:transmitting first data comprising a random data stream; andtransmitting second data comprising indicators as to which data of therandom data stream is valid data to be communicated, the first datatransmitted using quantum entanglement; wherein the random data streamis a random bit stream and the second data comprises a bit stream thatcorresponds to the random bit stream with a pause inserted to indicatethat a previous bit is a valid bit.
 2. The method of claim 1, whereinthe second data is transmitted over a different communication channel.3. The method of claim 1, wherein the pause is inserted in lieu of acurrent bit in the random bit stream.
 4. The method of claim 1, whereintwo consecutive pauses are inserted to indicate an end of character. 5.The method of claim 1, wherein three consecutive pauses are inserted toindicate an end of word.
 6. The method of claim 1, wherein fourconsecutive pauses are inserted to indicate an end of message.
 7. Amethod for transmitting data comprising: transmitting first datacomprising a random data stream; and transmitting second data comprisingindicators as to which data of the random data stream is valid data tobe communicated, the first data transmitted using quantum entanglement;wherein the random data stream is a random bit stream and the seconddata comprises a bit stream that corresponds to the random bit streamwith a first value of 0 inserted to indicate that a previous bit is avalid bit, and a second value of 1 is transmitted to indicate that acurrent bit is not a valid bit, and the 0 is inserted prior to insertingthe
 1. 8. A method for transmitting data comprising: transmitting firstdata comprising a random data stream; and transmitting second datacomprising indicators as to which data of the random data stream isvalid data to be communicated, the first data transmitted using quantumentanglement; wherein the random data stream is a random bit stream andthe second data comprises a bit stream that corresponds to the randombit stream with a pause being transmitted to indicate that a current bitis a valid bit, and otherwise transmitting the current bit.
 9. A methodfor transmitting data comprising: transmitting first data comprising arandom data stream; and transmitting second data comprising indicatorsas to which data of the random data stream is valid data to becommunicated, the first data transmitted using quantum entanglement;wherein the random data stream is a random bit stream and the seconddata comprises a bit stream that corresponds to the random bit streamwith a first value of 0 being transmitted to indicate that a current bitis a valid bit, and otherwise transmitting a second value of 1, and the0 is inserted prior to inserting the
 1. 10. An apparatus comprising: aquantum entanglement system configured to generate a random stream ofquantum entangled qbits and a corresponding stream of quantum entangledqbits; a first transmitter configured to transmit first data comprisingthe random stream of quantum entangled qbits generated by the quantumentanglement system; a comparator system configured to compare betweenvalid bits to be transmitted and the corresponding stream of quantumentangled qbits to determine which data of the first data stream isvalid; and a second transmitter configured to transmit second datacomprising indicators as to which data of the first data stream is validdata as determined by the comparator system.
 11. The apparatus of claim10, wherein the quantum entanglement system is configured to send aplurality of photons carrying the random data stream.
 12. The apparatusof claim 11, wherein the quantum entanglement system is further providedusing an entanglement creator configured to create a pair of entangledphotons in which a first entangled photon in the pair of entangledphotons is sent to meet with an incoming photon in the plurality ofphotons and in which a second entangled photon in the pair of entangledphotons is used to form an outgoing photon in the plurality of photons.13. The apparatus of claim 10, wherein the random data stream is arandom bit stream, and the second data comprises a bit stream thatcorresponds to the random bit stream with a pause inserted to indicatethat a previous bit is a valid bit.
 14. The apparatus of claim 10,wherein the random data stream is a random bit stream, and the seconddata comprises a bit stream that corresponds to the random bit streamwith a 1 inserted to indicate that a previous bit is a valid bit, a 0 istransmitted to indicate that a current bit is not a valid bit, and a 0is inserted prior to inserting the
 1. 15. The apparatus of claim 10,wherein the random data stream is a random bit stream, and the seconddata comprises a bit stream that corresponds to the random bit streamwith a pause being transmitted to indicate that a current bit is a validbit, and otherwise transmitting the current bit.
 16. The apparatus ofclaim 10, wherein the random data stream is a random bit stream, and thesecond data comprises a bit stream that corresponds to the random bitstream with a 0 being transmitted to indicate that a current bit is avalid bit, and otherwise transmitting a
 1. 17. A method for receivingdata comprising: receiving first data comprising an unencrypted randomdata stream using quantum entanglement; receiving second data sent, thesecond data comprising indicators as to which data of the unencryptedrandom data stream is valid data to be communicated, the indicatorsusable to identify portions of the unencrypted random data stream thatform the valid data; and using the first and second data to generate thevalid data; wherein the random data stream is a random bit stream andthe second data comprises a bit stream that corresponds to the randombit stream with a pause inserted to indicate that a previous bit is avalid bit.
 18. The method of claim 17, wherein the second data isreceived over a different communication channel.
 19. The method of claim17, wherein the pause is inserted in lieu of a current bit in the randombit stream.
 20. The method of claim 17, wherein two consecutive pausesare inserted to indicate an end of character.
 21. The method of claim17, wherein three consecutive pauses are inserted to indicate an end ofword.
 22. The method of claim 17, wherein four consecutive pauses areinserted to indicate an end of message.
 23. A method for receiving datacomprising: receiving first data comprising a random data stream; andreceiving second data comprising indicators as to which data of therandom data stream is valid data to be communicated, the first datatransmitted using quantum entanglement; wherein the random data streamis a random bit stream and the second data comprises a bit stream thatcorresponds to the random bit stream with a first value of 0 inserted toindicate that a previous bit is a valid bit, and a second value of 1 isreceived to indicate that a current bit is not a valid bit, and the 0 isinserted prior to inserting the
 1. 24. A method for receiving datacomprising: receiving first data comprising a random data stream; andreceiving second data comprising indicators as to which data of therandom data stream is valid data to be communicated, the first datatransmitted using quantum entanglement; wherein the random data streamis a random bit stream and the second data comprises a bit stream thatcorresponds to the random bit stream with a pause being received toindicate that a current bit is a valid bit, and otherwise receiving thecurrent bit.
 25. A method for receiving data comprising: receiving firstdata comprising a random data stream; and receiving second datacomprising indicators as to which data of the random data stream isvalid data to be communicated, the first data transmitted using quantumentanglement; wherein the random data stream is a random bit stream andthe second data comprises a bit stream that corresponds to the randombit stream with a first value of 0 being received to indicate that acurrent bit is a valid bit, and otherwise receiving a second value of 1,and the 0 is inserted prior to inserting the 1.